Robust algorithms for constructing strongly convex hulls in parallel
نویسندگان
چکیده
منابع مشابه
Robust algorithms for constructing strongly convex hulls in parallel
Given a set S of n points in the plane, an -strongly convex -hull of S is de0ned as a convex polygon P with the vertices taken from S such that no point of S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. This paper presents the 0rst parallel robust method for this generalized convex hull problem (note that the convex hull of ...
متن کاملConstructing Strongly Convex Hulls Using Exact or
One useful generalization of the convex hull of a set S of n points is the-strongly convex-hull. It is deened to be a convex polygon P with vertices taken from S such that no point in S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. It was an open question 1 as to whether an-strongly convex O()-hull existed for all positive. W...
متن کاملParallel Algorithms for Higher-Dimensional Convex Hulls
We give fast randomized and deterministic parallel methods for constructing convex hulls in IRd, for any fixed d. Our methods are for the weakest shared-memory model, the EREW PRAM, and have optimal work bounds (with high probability for the randomized methods). In particular, we show that the convex hull of n points in IRd can be constructed in O(logn) time using O(n logn + nbd=2c) work, with ...
متن کاملOptimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel
In this paper we focus on the problem of designing very fast parallel algorithms for the planar convex hull problem that achieve the optimal O(n log H) work-bound for input size n and output size H. Our algorithms are designed for the arbitrary CRCW PRAM model. We first describe a very simple ©(log n log H) time optimal deterministic algorithm for the planar hulls which is an improvement over t...
متن کاملFormalizing Convex Hulls Algorithms
We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerated cases th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00274-2